Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract)
نویسندگان
چکیده
We design combination techniques for symbolic constraint solving in the presence of associative and com-mutative (AC) function symbols. This yields an algorithm for solving AC-RPO constraints (where AC-RPO is the AC-compatible total reduction ordering of 16]), which was a missing ingredient for automated deduction strategies with AC-constraint inheritance 15, 19]. As in the AC-uniication case (actually the AC-uniication algorithm of 9] is an instance of ours), for this purpose we rst study the pure case, i.e. we show how to solve AC-ordering constraints built over a single AC function symbol and variables. Since AC-RPO is an interpretation-based ordering, our algorithm also requires the combination of algorithms for solving interpreted constraints and non-interpreted constraints.
منابع مشابه
The Interplay of Symbolic and Subsymbolic Processes in Anagram Problem Solving
Although connectionist models have provided insights into the nature of perception and motor control, connectionist accounts of higher cognition seldom go beyond an implementation of traditional symbol-processing theories. We describe a connectionist constraint satisfaction model of how people solve anagram problems. The model exploits statistics of English orthography, but also addresses the i...
متن کاملSymbolic Model-based Test Selection
This paper addresses the problem of model-based off-line selection of test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of reactive systems. Efficient solutions to this problem have been proposed for LTS finite-state models, based on the ioco conformance testing theory. In this paper, the approach is extended for infinite-state ...
متن کاملSolved Forms for Path Ordering
A usual technique in symbolic constraint solving is to apply transformation rules until a solved form is reached for which the problem becomes simple. Ordering constraints are well-known to be reducible to (a disjunction of) solved forms, but unfortunately no polynomial algorithm deciding the satissability of these solved forms is known. Here we deal with a diierent notion of solved form, where...
متن کاملSolved Forms for Path Ordering Constraints
A usual technique in symbolic constraint solving is to apply transformation rules until a solved form is reached for which the problem becomes trivial. Ordering constraints are well-known to be reducible to a disjunction of solved forms, but unfortunately no polynomial algorithm deciding the satissability of these solved forms is known. Surprisingly, it turns out that this is no longer the case...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کامل